Set-Limited Functions and Polynomial-Time Interior-Point Methods

نویسندگان

چکیده

Abstract In this paper, we revisit some elements of the theory self-concordant functions. We replace notion barrier by a new set-limited function, which forms wider class. show that proper functions ensure polynomial time complexity corresponding path-following method (PFM). Our PFM follows deviated path, connects an arbitrary feasible point with solution problem. present applications our approach to problems unconstrained optimization, for it ensures global linear rate convergence even in nonsmooth objective function.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial interior point cutting plane methods

Polynomial cutting plane methods based on the logarithmic barrier function and on the volumetric center are surveyed. These algorithms construct a linear programming relaxation of the feasible region, find an appropriate approximate center of the region, and call a separation oracle at this approximate center to determine whether additional constraints should be added to the relaxation. Typical...

متن کامل

Barrier Functions in Interior Point Methods

We show that the universal barrier function of a convex cone introduced by Nesterov and Nemirovskii is the logarithm of the characteristic function of the cone. This interpretation demonstrates the invariance of the universal barrier under the automorphism group of the underlying cone. This provides a simple method for calculating the universal barrier for homogeneous cones. We identify some kn...

متن کامل

Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

We establish polynomial-time convergence of infeasible-interior-point methods for conic programs over symmetric cones using a wide neighborhood of the central path. The convergence is shown for a commutative family of search directions used in Schmieta and Alizadeh [9]. These conic programs include linear and semidefinite programs. This extends the work of Rangarajan and Todd [8], which establi...

متن کامل

"Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods

We present a framework for designing and analyzing primal-dual interior-point methods for convex optimization. We assume that a self-concordant barrier for the convex domain of interest and the Legendre transformation of the barrier are both available to us. We directly apply the theory and techniques of interior-point methods to the given good formulation of the problem (as is, without a conic...

متن کامل

Polynomial and non-polynomial solutions set for wave equation with using Lie point symmetries

‎This paper obtains the exact solutions of the wave equation as a second-order partial differential equation (PDE)‎. ‎We are going to calculate polynomial and non-polynomial exact solutions by using Lie point symmetry‎. ‎We demonstrate the generation of such polynomial through the medium of the group theoretical properties of the equation‎. ‎A generalized procedure for polynomial solution is pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Optimization Theory and Applications

سال: 2023

ISSN: ['0022-3239', '1573-2878']

DOI: https://doi.org/10.1007/s10957-023-02163-x